A Branch-and-Cut Algorithm for Equitable Coloring
نویسندگان
چکیده
We present two new integer programming formulations for the equitable coloring problem. We also propose a primal constructive heuristic, branching strategies, and branch-and-cut algorithms based on each of these two formulations. The computational experiments showed that the results obtained by the new algorithms are far superior to those obtained by previously existing approaches.
منابع مشابه
A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives
Let G = (V,E) be an undirected graph, where V is the set of vertices and E is that of edges. An equitable k-coloring of G is a partition of V into k disjoint stable subsets such that the difference on the cardinalities of any two subsets is at most one. Each subset is associated with a color and called a color set. The Equitable Coloring Problem (ECP) consists of finding the minimum value of k ...
متن کاملA branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
An equitable k-coloring of a graph is defined by a partition of its vertices into k disjoint stable subsets, such that the difference between the cardinalities of any two subsets is at most one. The equitable coloring problem consists of finding the minimum value of k such that a given graph can be equitably k-colored. We present two new integer programming formulations based on representatives...
متن کاملPolyhedral results for the Equitable Coloring Problem
In this work we study the polytope associated with a 0/1 integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and derive sufficient conditions in order to be facet-defining inequalities. We also present computational evidence of the effectiveness of including these inequalities as cuts in a Branch & Cut algorithm.
متن کاملA Branch-and-Cut algorithm for graph coloring
In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent, avoids symmetry. We studied the facet structure of the 0/1-polytope associated with it. Based on these theoretical results, we present now a Branch-and-Cut algorithm for the graph coloring problem. Our computational experiences compare favorably with the well-known ex...
متن کاملOn Equitable Coloring of d-Degenerate Graphs
An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most 1. A d-degenerate graph is a graph G in which every subgraph has a vertex with degree at most d. A star Sm with m rays is an example of a 1-degenerate graph with maximum degree m that needs at least 1 + m/2 colors for an equitable coloring. Our main result is that every n-...
متن کامل